The Entropy Power Inequality and Mrs. Gerber's Lemma for groups of order 2n
نویسندگان
چکیده
Shannon’s Entropy Power Inequality (EPI) can be viewed as characterizing the minimum differential entropy achievable by the sum of two independent random variables with fixed differential entropies. The EPI is a powerful tool and has been used to resolve a number of problems in information theory. In this paper we examine the existence of a similar entropy inequality for discrete random variables. We obtain an entropy power inequality for random variables taking values in any group of order 2, i.e. for such a group G we explicitly characterize the function fG(x, y) giving the minimum entropy of the group product of two independent G-valued random variables with respective entropies x and y. Random variables achieving the extremum in this inequality are thus the analogs of Gaussians, and these are also determined. It turns out that fG(x, y) is convex in x for fixed y and, by symmetry, convex in y for fixed x. This is a generalization to groups of order 2 of the result known as Mrs. Gerber’s Lemma.
منابع مشابه
The Entropy Power Inequality and Mrs. Gerber's Lemma for Abelian Groups of Order 2^n
Shannon’s Entropy Power Inequality can be viewed as characterizing the minimum differential entropy achievable by the sum of two independent random variables with fixed differential entropies. The entropy power inequality has played a key role in resolving a number of problems in information theory. It is therefore interesting to examine the existence of a similar inequality for discrete random...
متن کاملMinimum MS. E. Gerber's Lemma
—Mrs. Gerber's Lemma lower bounds the entropy at the output of a binary symmetric channel in terms of the entropy of the input process. In this paper, we lower bound the output entropy via a different measure of input uncertainty, pertaining to the minimum mean squared error (MMSE) prediction cost of the input process. We show that in many cases our bound is tighter than the one obtained from M...
متن کاملGeneralization of Mrs. Gerber's Lemma
Mrs. Gerber’s Lemma (MGL) hinges on the convexity of H(p ∗ H(u)), where H(u) is the binary entropy function. In this work, we prove thatH(p∗f(u)) is convex in u for every p ∈ [0, 1] provided H(f(u)) is convex in u, where f(u) : (a, b) → [0, 1 2 ]. Moreover, our result subsumes MGL and simplifies the original proof. We show that the generalized MGL can be applied in binary broadcast channel to s...
متن کاملMorpho-phenology and chromosome number of Iranian Bromus danthoniae Trin. genotypes
ABSTRACT- Bromus danthoniae Trin. is an annual grass species which grows mainly on dry grassy rocky mountain slopes and grassy steppe, and is grazed by many herbivores and recognized as a useful pasture plant. The chromosome number, morphological and anatomical traits of 82 genotypes of B. danthoniae belonging to three sub-taxa were investigated. Twenty-seven quantitative and 20 qualitative mor...
متن کاملRate-Distortion with a Limited-Rate Helper to the Encoder and Decoder
Consider the rate-distortion problem, in which a helper sends a common limited-rate message both to the encoder and decoder based on side information at its disposal. We characterize the region of achievable rates and distortions for this problem. We derive these regions explicitly for binary doubly symmetric sources with Hamming distortion, and for Gaussian sources with square error distortion...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 60 شماره
صفحات -
تاریخ انتشار 2013